Перевод: с английского на все языки

со всех языков на английский

Boolean type

См. также в других словарях:

  • Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… …   Wikipedia

  • Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… …   Wikipedia

  • Boolean — Boo‧le‧an [ˈbuːliən] adjective [only before a noun] COMPUTING relating to a type of logic in which something can be either true or false, but not both: • online systems which make use of Boolean logic • a Boolean search (= a search for… …   Financial and business terms

  • Boolean grammar — Boolean grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context free grammars, with conjunction and negation operations. Besides these explicit operations, Boolean grammars… …   Wikipedia

  • Boolean — [bo͞o′lē ən] adj. 〚after G. Boole (1815 64), Eng mathematician〛 designating or of any of a number of mathematical systems, esp. one (Boolean algebra) devised using algebraic rules and symbols for the analysis of symbolic logic, which is now… …   Universalium

  • Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing …   Wikipedia

  • Boolean datatype — In computer science, the Boolean datatype, sometimes called the logical datatype , is a primitive datatype having one of two values: true and false. Many systems represent true as non zero (often 1, or 1) and false as zero . It is the special… …   Wikipedia

  • Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

  • Type (model theory) — In model theory and related areas of mathematics, a type is a set of first order formulas in a language L with free variables x1, x2,…, xn which are true of a sequence of elements of an L structure . Loosely speaking, types describe possible… …   Wikipedia

  • Boolean delay equation — As a novel type of semi discrete dynamical systems, Boolean Delay Equations (BDEs) are models with Boolean valued variables that evolve in continuous time. Since at the present time, most phenomena are too complex to be modeled by partial… …   Wikipedia

  • Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»